🎄 Adaptive Radix Trees - hello · Scour

understanding LSM trees via read, write, and space amplification

bitsxpages.com·10h

Union-Find Path Compression: A Visual Dry Run

dev.to·1d·

Discuss: DEV

📦Succinct Data Structures

Postmortem on TreeTracker Join: Simple, Optimal, Fast

zhu45.org·2d·

Discuss: Hacker News

🔗Join Algorithms

GNU C Language Manual

gnu.org·14h

🔨Compiler Design

HeteroCache: A Dynamic Retrieval Approach to Heterogeneous KV Cache Compression for Long-Context LLM Inference

arxiv.org·1d

⚡Cache Optimization

cwida/fsst: Fast Static Symbol Table (FSST): efficient random-access string compression

github.com·2d·

Discuss: Hacker News

🗜️Columnar Compression

Memory layout matters: Reducing metric storage overhead by 4x in a Rust TSDB

baarse.substack.com·18h·

Discuss: r/rust

🏛️Region-Based Memory

Visualizing K-Way Merge&#58 An Interactive Guide to Database Sorting

justinhj.github.io·3d

📦Succinct Data Structures

ClickPy at 2 Trillion rows: Scaling ingestion and fixing the past

clickhouse.com·22h

📊Vectorized Query Execution

Patterns All the Way Down: A Generalization for Graph-Like Things

medium.com·17h·

Discuss: Hacker News

🪢Rope Data Structure

MIT's Recursive Language Models Improve Performance on Long-Context Tasks

infoq.com·1d

💬Prompt Engineering

Binary Algorithms

exystence.net·1d

⏭️Skip Lists

ANN v3: 200ms p99 query latency over 100 billion vectors

turbopuffer.com·1d·

Discuss: Hacker News

🌊Memory Bandwidth

Variation on Iota

toolofthought.com·3d·

Discuss: Hacker News

#️⃣Perfect Hashing

Build Your Own Key-Value Storage Engine—Week 6

read.thecoder.cafe·20h

#️⃣Hash Tables

GPU-Resident Inverted File Index for Streaming Vector Databases

arxiv.org·1d

prepend.com·1d

💻Terminal Tools

Relaxed Radix Balanced Trees

peter.horne-khan.com·4d

🔴Red-Black Trees

PanMAN Enables Scalable High-Resolution Pangenome Analysis

cbirt.net·7h

🧬Computational Biology

The Evolution of Redis: From Cache to AI-Database (V1.0 to 8.4)

percona.com·20h

🐉DragonflyDB

Loading more...